Nuprl Lemma : fun_thru_spread
9,38
postcript
pdf
A
:Type,
B
:(
A
Type),
p
:(
x
:
A
B
(
x
)),
C
,
D
:Type,
f
:(
C
D
),
b
:(
x
:
A
B
(
x
)
C
).
f
(let
x
,
y
=
p
in
b
(
x
,
y
)) = let
x
,
y
=
p
in
f
(
b
(
x
,
y
))
latex
ProofTree
Definitions
t
T
,
x
(
s
)
,
x
:
A
.
B
(
x
)
,
x
(
s1
,
s2
)
origin
A:Type, B:(A
Type), p:(x:A 
B(x)), C,D:Type, f:(CD), b:(x:AB(x)C).
A:Type, B:(AType), p:(x:A B(x)), C,D:Type, f:(CD), b:(x:AB(x)C).
Tx:A. B(x)